public class Search {


	public static int sequentialSearch(int[] a, int n) {
		for (int i=0; i < a.length; ++i) {
			if (a[i] == n) {
				return i;
			}
		}
		return -1;
	}

	public static int binarySearch(int[] a, int n) {
		int low = 0;
		int high = a.length - 1;
		int mid;

		while (low <= high) {
			mid = (low + high) / 2;
			
			if (a[mid] < n) {
				low = mid + 1;
			}
			else if (a[mid] > n) {
				high = mid - 1;
			}
			else {
				return mid;
			}
		}

		return -1;
	}

	public static void main(String[] args) {
		int[] a = new int[Integer.parseInt(args[0])];
		for (int i=0; i < a.length; ++i) {
			a[i] = i;
		}

		int n = Integer.parseInt(args[1]);
		
		System.out.println("Binary searching for " + n);
		System.out.println("Result: " + binarySearch(a, n));
		System.out.flush();
		
		System.out.println("Sequential searching for " + n);
		System.out.println("Result: " + sequentialSearch(a, n));
		System.out.flush();
	}
}